A note on quantum black-box complexity of almost all Boolean functions
نویسنده
چکیده
We show that, for almost all N -variable Boolean functions f , N/4 − O( √ N log N) queries are required to compute f in quantum black-box model with bounded error.
منابع مشابه
ar X iv : q ua nt - p h / 98 02 04 9 v 3 30 S ep 1 99 8 Quantum Lower
We examine the number T of queries that a quantum network requires to compute several Boolean functions on {0, 1}N in the black-box model. We show that, in the blackbox model, the exponential quantum speed-up obtained for partial functions (i.e. problems involving a promise on the input) by Deutsch and Jozsa and by Simon cannot be obtained for any total function: if a quantum algorithm computes...
متن کاملImproved Bounds on Quantum Learning Algorithms
In this article we give several new results on the complexity of algorithms that learn Boolean functions from quantum queries and quantum examples. • Hunziker et al. [17] conjectured that for any class C of Boolean functions, the number of quantum black-box queries which are required to exactly identify an unknown function from C is at most O( log |C| √ γ̂ ), where γ̂ is a combinatorial parameter...
متن کاملQuantum Algorithms for Learning and Testing Juntas
In this article we develop quantum algorithms for learning and testing juntas, i.e. Boolean functions which depend only on an unknown set of k out of n input variables. Our aim is to develop efficient algorithms: • whose sample complexity has no dependence on n, the dimension of the domain the Boolean functions are defined over; • with no access to any classical or quantum membership (“black-bo...
متن کاملUnbounded-Error Quantum Query Complexity
This work studies the quantum query complexity of Boolean functions in a scenario where it is only required that the query algorithm succeeds with a probability strictly greater than 1/2. We show that, just as in the communication complexity model, the unbounded error quantum query complexity is exactly half of its classical counterpart for any (partial or total) Boolean function. Moreover, we ...
متن کاملQuantum versus Classical Learnability
Motivated by recent work on quantum black-box query complexity, we consider quantum versions of two wellstudied models of learning Boolean functions: Angluin’s model of exact learning from membership queries and Valiant’s Probably Approximately Correct (PAC) model of learning from random examples. For each of these two learning models we establish a polynomial relationship between the number of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 71 شماره
صفحات -
تاریخ انتشار 1999